例句與造句

1. The matrix solution optimization to programme kinds of linear question
   可編程類線性問題矩陣解法優(yōu)化
2. Positive semidefinite hermitian matrix solution of a matrix equations
   特殊子空間上矩陣方程有解的判定
3. Method for matrix solution of constant coefficient recursive sequences general term equation
   常系數(shù)遞歸數(shù)列通項公式的矩陣求法
4. Matrix solution of integral indefinite equation of first degree and its program composition
   整數(shù)多元一次不定方程的矩陣解法與程序設(shè)計
5. A matrix solution for differential equation is presented for solving the problem of mathematics " calculation
   為了解決數(shù)學(xué)計算問題，給出了衍射微分方程的矩陣解。
6. It's difficult to find matrix solution in a sentence. 用matrix solution造句挺難的
7. Scattering simulation for inhomogeneous layered canopy and random targets beneath canopies by using the mueller matrix solution of the pulse radiative transfer jin yaqiu , chen fei
   極化脈沖回波mueller矩陣解數(shù)值模擬非均勻分層植被與其中隨機目標的散射[金亞秋,陳扉]
8. Scattering simulation for inhomogeneous layered canopy and random targets beneath canopies by using the mueller matrix solution of the pulse radiative transfer ( jin yaqiu , chen fei )
   極化脈沖回波mueller矩陣解數(shù)值模擬非均勻分層植被與其中隨機目標的散射[金亞秋,陳扉]
9. Based on the research work on matrix solution techniques , we propose a incomplete cholesky pre - conditioning based conjugate gradient solution technique . this technique can take advantage of the special properties of power grid and solve the circuits in a fast speed
   在深入研究地基礎(chǔ)上，本文提出了基于不完全cholesky分解的共軛梯度電路求解算法能夠?qū)崿F(xiàn)電源網(wǎng)格的快速求解。
10. There are : aco _ norm algorithm which applies the local normalized ants - seed pheromone update rule for the matrix solution construction ; the aco _ stag algorithm which is characterized by the stagnation step out mechanism and the pheromone trail limit mechanism ; the ant - q ( ) algorithm which is based on eligibility trace
    11摘要提出了fiowshop問題的一個局部歸一化螞蟻種于算法acoporm ，一個引入停滯狀態(tài)脫離機制以及信息素蹤跡限制機制的acostag算法和一個基于資格跡的antq0 ）算法。算法還提出了一種基于dannenbring方法的啟發(fā)式信息。
11. The local normalized ants - seed pheromone update rule for the matrix solution construction is presented to ensure that the sum of the pheromone distributed over a row of the nodes in the construction graph is a constant , and it can be proved that for the non - constrained matrix construction graph , the local normalized ants - seed pheromone updat e rule is a minimum cross - entropy pheromone update rule
    然后定義了一種特殊的解構(gòu)造圖-矩陣解構(gòu)造圖，并提出了flowshop問題的矩陣解構(gòu)造圖模型，同時針對矩陣解構(gòu)造圖提出了局部歸一化的螞蟻種子信息素更新規(guī)則，該規(guī)則能保證分布在矩陣解構(gòu)造圖每一行結(jié)點上的信息素總量保持恒定。